翻訳と辞書 Words near each other ・ Longford, Market Drayton ・ Longford, Newport ・ Longford, Tasmania ・ Longford, U.S. Virgin Islands ・ Longford, Victoria ・ Longford, Warrington ・ Longest recorded sniper kills ・ Longest reigning heavyweight champions ・ Longest repeated substring problem ・ Longest rivers of the United Kingdom ・ Longest squash match records ・ Longest tennis match records ・ Longest tiebreaker in tennis ・ Longest train services ・ Longest trains ・ Longest uncrossed knight's path ・ Longest word in English ・ Longest word in Spanish ・ Longest word in Turkish ・ Longest words ・ Longest Year (EP) ・ Longest-lasting light bulbs ・ Longetia ・ Longevelle ・ Longevelle-lès-Russey ・ Longevelle-sur-Doubs ・ Longeville ・ Longeville-en-Barrois ・ Longeville-lès-Metz ・ Longeville-lès-Saint-Avold Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Longest uncrossed knight's path ： ウィキペディア英語版 Longest uncrossed knight's path The longest uncrossed (or nonintersecting) knight's path is a mathematical problem involving a knight on the standard 8×8 chessboard or, more generally, on a square ''n''×''n'' board. The problem is to find the longest path the knight can take on the given board, such that the path does not intersect itself. A further distinction can be made between a closed path, which ends on the same field as where it begins, and an open path, which ends on a different field from where it begins. == Known solutions == The longest open paths are known only for ''n'' ≤ 9. Their lengths for ''n'' = 1, 2, …, 9 are: :0, 0, 2, 5, 10, 17, 24, 35, 47 The longest closed paths are known only for ''n'' ≤ 10. Their lengths for ''n'' = 1, 2, …, 10 are: : 0, 0, 0, 4, 8, 12, 24, 32, 42, 54 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Longest uncrossed knight's path」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.